Model-Checking over Multi-valued Logics
نویسندگان
چکیده
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when information is gathered from multiple sources). In this paper we propose the use of quasi-boolean multi-valued logics for reasoning about such systems. We also give semantics to a multi-valued extension of CTL, describe an implementation of a symbolic multi-valued CTL model-checker called chek, and analyze its correctness and running time.
منابع مشابه
CTL Model-Checking over Logics with Non-Classical Negations
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois and minimal negations, calling the resulting language CTL. We define CTL operators and show that they can be computed using fixpoints. We further discuss how to extend our existing multi-valued model-checker Chek [8] to re...
متن کاملData structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlier work we identified a useful family of multi-valued logics: those specified over finite distributive lattices where negation preserves involution, i.e., , , -/.0for every element of the logic. Model-checking over this...
متن کاملAn Introduction to Multi-Valued Model Checking
Nowadays computer systems have become ubiquitous. Most of the resources in the development of such systems, and especially in the fail-safe ones, are allocated into the simulation and verification of their behavior. One such automated method of verification is model checking. Given a mathematical description of the real system and a specification usually in the form of temporal logics, a model ...
متن کاملModel Checking with Multi-valued Logics
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multi-valued model checking. We first show how to reduce multi-valued model checking with any distributive DeMorgan lattice to standard, two-valued model checking. We then present a direct, automata-theoretic a...
متن کاملχChek: A Model Checker for Multi-Valued Reasoning
This paper describes our multi-valued symbolic modelchecker χChek. χChek is a generalization of an existing symbolic model-checking algorithm for a multi-valued extension of the temporal logic CTL. Multi-valued modelchecking supports reasoning with values other than just TRUE and FALSE. Multi-valued logics are useful in software engineering because they support explicit modeling of uncertainty,...
متن کامل